A Multipopulation Evolutionary Algorithm for Solving Large-Scale Multimodal Multiobjective Optimization Problems
نویسندگان
چکیده
Multimodal multiobjective optimization problems (MMOPs) widely exist in real-world applications, which have multiple equivalent Pareto-optimal solutions that are similar the objective space but totally different decision space. While some evolutionary algorithms (EAs) been developed to find recent years, they ineffective handle large-scale MMOPs having a large number of variables. This article thus proposes an EA for solving with sparse solutions, i.e., most variables optimal 0. The proposed algorithm explores regions via subpopulations and guides search behavior adaptively updated guiding vectors. vector each subpopulation not only provides efficient convergence huge also differentiates its direction from others multimodality. existing EAs solve 2-7 variables, is shown be effective benchmark up 500 Moreover, produces better result than state-of-the-art methods neural architecture search.
منابع مشابه
Solving Multiobjective Optimization Problems using Evolutionary Algorithm
Being capable of finding a set of pareto–optimal solutions in a single run, which is a necessary feature for multi–criteria decision making, Evolutionary Algorithms (EAs) has attracted many researchers and practitioners to address the solution of Multiobjective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multiobjective...
متن کاملMultiobjective Evolutionary Algorithm Approach For Solving Integer Based Optimization Problems
Multiobjective Evolutionary algorithms (MOEAs) are often well-suited for complex combinatorial Multiobjective optimization problems (MOPs). Integer based MOPs are prevalent in real world applications where there exist a discrete amount of a component or quantity of an item. Presented here is the application of a building block based MOEA, the MOMGA-II, to a NP Complete problem and real-world ap...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملA Multipopulation Differential Evolution Algorithm for Multimodal Optimization
The aim of this work is to analyze the ability of a multipopulation differential evolution to locate all optima of a multimodal function. The exploration is assured by a controlled initialization of the subpopulations while a particular differential evolution algorithm assures the exploitation. To avoid the necessity of specifying a niche radius a multi-resolution approach is proposed. All loca...
متن کاملPIBEA: Prospect Indicator Based Evolutionary Algorithm for Multiobjective Optimization Problems
This paper proposes and evaluates an evolutionary multiobjective optimization algorithm (EMOA) that uses a new quality indicator, called the prospect indicator, for parent selection and environmental selection operators. The prospect indicator measures the potential of each individual to reproduce offspring that dominate itself and spread out in the objective space. The prospect indicator allow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2021
ISSN: ['1941-0026', '1089-778X']
DOI: https://doi.org/10.1109/tevc.2020.3044711